Typed Closure Conversion for Recursively-Defined Functions
نویسندگان
چکیده
منابع مشابه
Typed Closure Conversion for Recursively-deened Functions (extended Abstract)
Much recent work on the compilation of statically typed languages such as ML relies on the propagation of type information from source to object code in order to increase the reliability and maintainabilty of the compiler itself and to improve the eeciency and veriiability of generated code. To achieve this the program transformations performed by a compiler must be cast as type-preserving tran...
متن کاملTyped Closure Conversion for Recursively - De ned Functions ( Extended
Much recent work on the compilation of statically typed languages such as ML relies on the propagation of type information from source to object code in order to increase the reliability and maintainabilty of the compiler itself and to improve the e ciency and veri ability of generated code. To achieve this the program transformations performed by a compiler must be cast as type-preserving tran...
متن کاملFlow-Directed Closure Conversion for Typed Languages
This paper presents a novel closure conversion strategy which is part of MLton, a whole-program compiler for Standard ML. Unlike other implementations, MLton performs closure-conversion at an early stage to translate programs to a simply-typed rst-order intermediate language upon which most optimizations are performed. Closure conversion is guided by a global control-ow analysis. Like previous ...
متن کاملRecursively defined combinatorial functions: extending Galton's board
Many functions in combinatorics follow simple recursive relations of the type F (n, k) = an−1,kF (n − 1, k) + bn−1,k−1F (n − 1, k − 1). Treating such functions as (infinite) triangular matrices and calling an,k and bn,k generators of F , our paper will study the following question: Given two triangular arrays and their generators, how can we give explicit formulas for the generators of the prod...
متن کاملDomain Theory II: Recursively Defined Functions
The examples in Chapter 5 provide strong evidence that denotational semantics is an expressive and convenient tool for language definition. Yet a few gaps remain to be filled. In Figure 5.3, the copyout function, which concatenates two lists, is not given. We can specify copyout using an iterative or recursive specification, but at this point neither is allowed in the function notation. A simil...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 1998
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(05)80702-9